Symmetrized nearest neighbor regression estimates
نویسندگان
چکیده
منابع مشابه
Unsupervised K-Nearest Neighbor Regression
In many scientific disciplines structures in highdimensional data have to be found, e.g., in stellar spectra, in genome data, or in face recognition tasks. In this work we present a novel approach to non-linear dimensionality reduction. It is based on fitting K-nearest neighbor regression to the unsupervised regression framework for learning of low-dimensional manifolds. Similar to related appr...
متن کاملFractional Regression Nearest Neighbor Imputation
Sample surveys typically gather information on a sample of units from a finite population and assign survey weights to the sampled units. Survey frequently have missing values for some variables for some units. Fractional regression imputation creates multiple values for each missing value by adding randomly selected empirical residuals to predicted values. Fractional imputation methods assign ...
متن کاملDiscriminant Adaptive Nearest Neighbor Classification and Regression
Robert Tibshirani Department of Statistics University of Toronto tibs@utstat .toronto.edu Nearest neighbor classification expects the class conditional probabilities to be locally constant, and suffers from bias in high dimensions We propose a locally adaptive form of nearest neighbor classification to try to finesse this curse of dimensionality. We use a local linear discriminant analysis to e...
متن کاملSimultaneous Interval Regression for K-Nearest Neighbor
In some regression problems, it may be more reasonable to predict intervals rather than precise values. We are interested in finding intervals which simultaneously for all input instances x ∈ X contain a β proportion of the response values. We name this problem simultaneous interval regression. This is similar to simultaneous tolerance intervals for regression with a high confidence level γ ≈ 1...
متن کاملNecessary and Sufficient Conditions for the Pointwise Convergence of Nearest Neighbor Regression Function Estimates
where (v,1, ..., v,,) is a given probability vector, and (Xt(x), Yl(x)), ..., (X.(x), Y,(x)) is a permutation of (X1, I71) . . . . , (X, , Y,) according to increasing values of IlXi-x[I, x e R a. When [IXi-xll = H X j x l [ but i < j , X i is said to be closer to x than X~. The consistency properties of m, for special choices of the weight vector (v,,, ..., v,,,) are discussed in Cover (1968), ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Statistics & Probability Letters
سال: 1989
ISSN: 0167-7152
DOI: 10.1016/0167-7152(89)90114-4